Antenna Array Pattern Synthesis via Coordinate Descent Method
نویسندگان
چکیده
منابع مشابه
Antenna array pattern synthesis via convex optimization
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great eeciency by recently developed interior-point methods. The synthesis problems involve arrays with arbitrary geometry and element directivity, constraints on far and near eld patterns over narrow or broad frequency bandwidth, and some i...
متن کاملPenalized Bregman Divergence Estimation via Coordinate Descent
Variable selection via penalized estimation is appealing for dimension reduction. For penalized linear regression, Efron, et al. (2004) introduced the LARS algorithm. Recently, the coordinate descent (CD) algorithm was developed by Friedman, et al. (2007) for penalized linear regression and penalized logistic regression and was shown to gain computational superiority. This paper explores...
متن کاملA Pattern Synthesis Method for Large Planar Antenna Array
The pattern synthesis for large antenna arrays is very important because of its wide applications. Several antenna array synthesis techniques for planar antenna array have been developed in the past years. In this paper, a hybrid method for solving antenna array pattern synthesis problem is introduced. The proposed method has three steps. Firstly, the iterative fast Fourier transforms (IFT) is ...
متن کاملSynthesis of Volumetric Ring Antenna Array for Terrestrial Coverage Pattern
This paper presents a synthesis of a volumetric ring antenna array for a terrestrial coverage pattern. This synthesis regards the spacing among the rings on the planes X-Y, the positions of the rings on the plane X-Z, and uniform and concentric excitations. The optimization is carried out by implementing the particle swarm optimization. The synthesis is compared with previous designs by resulti...
متن کاملAntenna Array Pattern Synthesis via Convex Optimization - Signal Processing, IEEE Transactions on
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great efficiency by recently developed interior-point methods. The synthesis problems involve arrays with arbitrary geometry and element directivity, constraints on farand near-field patterns over narrow or broad frequency bandwidth, and som...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Electromagnetic Analysis and Applications
سال: 2015
ISSN: 1942-0730,1942-0749
DOI: 10.4236/jemaa.2015.75018